Consensus Ranking with Signed Permutations
نویسندگان
چکیده
Signed permutations (also known as the hyperoctahedral group) are used in modeling genome rearrangements. The algorithmic problems they raise are computationally demanding when not NP-hard. This paper presents a tractable algorithm for learning consensus ranking between signed permutations under the inversion distance. This can be extended to estimate a natural class of exponential models over the group of signed permutations. We investigate experimentally the efficiency of our algorithm for modeling data generated by random reversals.
منابع مشابه
Bijective Combinatorics of Reduced Decompositions
We study the bijective combinatorics of reduced words. These are fundamental objects in the study of Coxeter groups. We restrict our focus to reduced words of permutations and signed permutations. Our results can all be situated within the context of two parallels. The first parallel is between the enumerative theory of reduced words and that of Coxeter group elements. The second parallel is be...
متن کاملMacMahon-type Identities for Signed Even Permutations
MacMahon’s classic theorem states that the length and major index statistics are equidistributed on the symmetric group Sn. By defining natural analogues or generalizations of those statistics, similar equidistribution results have been obtained for the alternating group An by Regev and Roichman, for the hyperoctahedral group Bn by Adin, Brenti and Roichman, and for the group of even-signed per...
متن کاملOn reconstruction of signed permutations distorted by reversal errors
The problem of reconstructing signed permutations on n elements from their erroneous patterns distorted by reversal errors is considered in this paper.A reversal is the operation of taking a segment of the signed permutation, reversing it, and flipping the signs of its elements. The reversal metric is defined as the least number of reversals transforming one signed permutation into another. It ...
متن کاملCounting involutory, unimodal, and alternating signed permutations
In this work we count the number of involutory, unimodal, and alternating elements of the group of signed permutations Bn, and the group of even-signed permutations Dn. Recurrence relations, generating functions, and explicit formulas of the enumerating sequences are given. © 2006 Elsevier B.V. All rights reserved. MSC: primary: 05A15; secondary: 05A19; 05A05
متن کاملLabeled partitions with colored permutations
In this paper, we extend the notion of labeled partitions with ordinary permutations to colored permutations in the sense that the colors are endowed with a cyclic structure. We use labeled partitions with colored permutations to derive the generating function of the fmajk indices of colored permutations. The second result is a combinatorial treatment of a relation on the q-derangement numbers ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013